Constructing an asymptotic phase transition in random binary constraint satisfaction problems
نویسنده
چکیده
منابع مشابه
Locating the phase transition in binary satisfaction problems
The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solutions, as the constraints become tighter, is investigated by examining the behaviour of samples of randomly-generated problems. In contrast to theoretical work, which is concerned with the asympto...
متن کاملLocating the Phase Transition in Binary Constraint Satisfaction Problems
The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solutions, as the constraints become tighter, is investigated by examining the behaviour of samples of randomly-generated problems. In contrast to theoretical work, which is concerned with the asympto...
متن کاملThe Phase Transition Behaviour of Non-binary Forward Checking Algorithms
In this paper the phase transition, that is to say the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solution as the constraints become tighter, is investigated by examining n-ary Constraint Satisfaction Problems (CSPs). The paper reports a series of experiments with samples of randomly-generated problems, using a fami...
متن کاملWhere the Exceptionally Hard Problems Are 1
Constraint satisfaction problems exhibit a phase transition as a problem parameter is varied, from a region where most problems are easy and soluble to a region where most problems are easy but insoluble. In the intervening phase transition region, the median problem diiculty is greatest. However, in the easy and soluble region, occasional exceptionally hard problems (ehps) can be found, which ...
متن کاملPhase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference
Identifying tractable subclasses and design ing efficient algorithms for these tractable classes are important topics in the study of constraint satisfaction and Bayesian network inference problems. In this paper we inves tigate the asymptotic average behavior of a typical tractable subclass characterized by the treewidth of the problems. We show that the property of having a bounded treewidt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 265 شماره
صفحات -
تاریخ انتشار 2001